Anupam Supercomputer Systems
نویسندگان
چکیده
The development of ANUPAM supercomputer systems based on parallel processing techniques has been the most outstanding achievement of Computer Division, BARC. ANUPAM Pentium III/16, is the latest and fastest supercomputer developed in April 2000, using 16 Pentium III @ 550 MHz. personal computers as compute nodes. This supercomputer is having a sustained speed of 3.5 Giga Flops, which is 2-3 times higher than the speed achieved on any of the supercomputers developed indigenously so far. In December 1991, Computer Division, BARC, entered the field of R&D in the supercomputing, when it developed the first supercomputer ANUPAM 860/4 using 4 Intel 860 microprocessor based boards as compute nodes giving a sustained speed of 30 Mega Flops. Subsequently, the computing speed available on the ANUPAM series of supercomputers was gradually increased by adding more number of compute nodes.
منابع مشابه
Enhanced reheating via Bose condensates
Rouzbeh Allahverdi, Robert Brandenberger, and Anupam Mazumdar Theory Group, TRIUMF, 4004 Wesbrook Mall, Vancouver, British Columbia, Canada V6T 2A3 Physics Department, Brown University, Providence, Rhode Island 02912, USA Perimeter Institute, Waterloo, Ontario, Canada N2J 2W9 Physics Department, McGill University, 3600 University Road, Montréal, Quebec, Canada H3A 2T8 (Received 28 July 2004; pu...
متن کاملParallelization of Neutron Transport Code ATES3 on BARC’s Parallel System
A Neutron Transport Code ATES3 (Anisotropic Transport Equation Solver in 3D), which was developed at BARC for the deterministic solution of 3D steady-state neutron transport problems, has been parallelized using Message Passing Parallel Programming model on BARC’s ANUPAM Parallel Supercomputer. The most time consuming step in the code ATES3, which is transport sweep, was made parallel using thr...
متن کاملThe Evolution of Anupam Supercomputers
Computers have become ubiquitous in all walks of scientific endeavour. There have been innumerable architectures of computers, aiding equally countless, diverse fields of research, thereby rendering the task of classification of computers itself a nontrivial job. Interestingly, this gamut of computers are classified neither by their explicit features nor by the class of application to which the...
متن کاملMATRIX: MAny-Task computing execution fabRIc at eXascale
Efficiently scheduling large number of jobs over large-scale distributed systems is critical in achieving high system utilization and throughput. Today’s state-of-the-art job management systems have predominantly Master/Slaves architectures, which have inherent limitations, such as scalability issues at extreme scales (e.g. petascales and beyond) and single point of failure. In designing the ne...
متن کامل20 th International Symposium on Mathematical Programming 121
■ FA01 Marriott Chicago A Approximation Algorithms III Cluster: Approximation Algorithms Invited Session Chair: Cliff Stein, Columbia University, 326 S W Mudd Building, 500 W. 120th Street, New York, NY, 10027, [email protected] 1 Differentially Private Approximation Algorithms Kunal Talwar, Microsoft Research, Silicon Valley Campus, 1065 La Avenida, Mountain View, CA, 94043, United State...
متن کامل